Equivalence-preserving first-order unfold/fold transformation systems
نویسندگان
چکیده
منابع مشابه
An Equivalence-Preserving Transformation of Shift Registers
The Fibonacci-to-Galois transformation is useful for reducing the propagation delay of feedback shift register-based stream ciphers and hash functions. In this paper, we extend it to handle Galois-to-Galois case as well as feedforward connections. This makes possible transforming Trivium stream cipher and increasing its keystream data rate by 27% without any penalty in area. The presented trans...
متن کاملOn Compilation of Higher-Order Concurrent Programs into First Order Programs Preserving Scope Equivalence
This paper discusses the expressive power of a graph rewriting model of concurrent processes with higherorder communication. As we reported before, it is difficult to represent the scopes of names using models based on process algebra. Then we presented a model of concurrent systems based on graph rewriting. The model makes it possible to represent the scopes of names precisely. We defined an e...
متن کاملBisimulation Equivalence of First-Order Grammars
A decidability proof for bisimulation equivalence of first-order grammars (finite sets of labelled rules for rewriting roots of first-order terms) is presented. The equivalence generalizes the DPDA (de-terministic pushdown automata) equivalence, and the result corresponds to the result achieved by Sénizergues (1998, 2005) in the framework of equational graphs, or of PDA with restricted ε-steps....
متن کاملBisimulation Equivalence for First-Order Grammars
A self-contained proof of the decidability of bisimulation equivalence for first-order grammars is given. This provides an alternative to Sénizergues’ decidability proof (1998, 2005) for nondeterministic pushdown automata with deterministic popping ε-steps, which generalized his decidability proof for the famous problem of language equivalence of deterministic pushdown automata (1997, 2001). On...
متن کاملOperational Equivalence of Graph Transformation Systems
Graph transformation systems (GTS) provide an important theory for numerous applications. With the growing number of GTSbased applications the comparison of operational equivalence of two GTS becomes an important area of research. This work introduces a notion of operational equivalence for graph transformation systems. The embedding of GTS in constraint handling rules (CHR) provides the basis ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90287-p